0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : run_E %s %d THM 0.13/0.33 % Computer : n015.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 960 0.13/0.33 % WCLimit : 120 0.13/0.33 % DateTime : Tue Aug 9 07:26:56 EDT 2022 0.13/0.34 % CPUTime : 0.19/0.47 Running higher-order on 8 cores theorem proving 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.47 # Version: 3.0pre003-ho 0.19/0.49 # Preprocessing class: HSMSSMSSSSSNSSA. 0.19/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.19/0.49 # Starting post_as_ho1 with 600s (5) cores 0.19/0.49 # Starting post_as_ho12 with 120s (1) cores 0.19/0.49 # Starting new_ho_3 with 120s (1) cores 0.19/0.49 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.19/0.49 # post_as_ho12 with pid 14615 completed with status 0 0.19/0.49 # Result found by post_as_ho12 0.19/0.49 # Preprocessing class: HSMSSMSSSSSNSSA. 0.19/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.19/0.49 # Starting post_as_ho1 with 600s (5) cores 0.19/0.49 # Starting post_as_ho12 with 120s (1) cores 0.19/0.49 # No SInE strategy applied 0.19/0.49 # Search class: HGUSF-FFSF21-SSSFFSBN 0.19/0.49 # Scheduled 5 strats onto 1 cores with 120 seconds (120 total) 0.19/0.49 # Starting post_as_ho12 with 73s (1) cores 0.19/0.49 # post_as_ho12 with pid 14619 completed with status 0 0.19/0.49 # Result found by post_as_ho12 0.19/0.49 # Preprocessing class: HSMSSMSSSSSNSSA. 0.19/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.19/0.49 # Starting post_as_ho1 with 600s (5) cores 0.19/0.49 # Starting post_as_ho12 with 120s (1) cores 0.19/0.49 # No SInE strategy applied 0.19/0.49 # Search class: HGUSF-FFSF21-SSSFFSBN 0.19/0.49 # Scheduled 5 strats onto 1 cores with 120 seconds (120 total) 0.19/0.49 # Starting post_as_ho12 with 73s (1) cores 0.19/0.49 # Preprocessing time : 0.001 s 0.19/0.49 # Presaturation interreduction done 0.19/0.49 0.19/0.49 # Proof found! 0.19/0.49 # SZS status Theorem 0.19/0.49 # SZS output start CNFRefutation 0.19/0.49 thf(decl_22, type, y: iS). 0.19/0.49 thf(decl_23, type, x: iS). 0.19/0.49 thf(decl_24, type, cP: iS > iS > iS). 0.19/0.49 thf(decl_25, type, c0: iS). 0.19/0.49 thf(decl_26, type, esk1_1: (iS > $o) > iS). 0.19/0.49 thf(decl_27, type, esk2_1: (iS > $o) > iS). 0.19/0.49 thf(decl_28, type, epred1_0: iS > iS > iS > $o). 0.19/0.49 thf(cS_INCL_LEM5_pme, conjecture, (((![X1:iS, X2:iS, X3:iS, X4:iS]:(((((X1)=(X2))&((X3)=(X4)))<=((cP @ X1 @ X3)=(cP @ X2 @ X4))))&![X5:iS > $o]:(((![X1:iS, X2:iS]:((((X5 @ X1)&(X5 @ X2))=>(X5 @ (cP @ X1 @ X2))))&(X5 @ c0))=>![X1:iS]:((X5 @ X1)))))&![X1:iS, X2:iS]:(((cP @ X1 @ X2)!=(c0))))=>![X6:iS > iS > iS > $o]:(((X6 @ (cP @ c0 @ y) @ (cP @ x @ y) @ (cP @ x @ y))<=(![X7:iS, X8:iS, X9:iS]:((((((X7)=(c0))&((X8)=(X9)))|?[X10:iS, X11:iS, X12:iS, X13:iS, X14:iS, X15:iS]:(((((((X7)=(cP @ X10 @ X11))&((X8)=(cP @ X12 @ X13)))&((X9)=(cP @ X14 @ X15)))&(X6 @ X10 @ X12 @ X14))&(X6 @ X11 @ X13 @ X15)))|(((X7)=(X9))&((X8)=(c0))))=>(X6 @ X7 @ X8 @ X9)))&($true))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cS_INCL_LEM5_pme)). 0.19/0.49 thf(c_0_1, negated_conjecture, ~((((![X1:iS, X2:iS, X3:iS, X4:iS]:((((cP @ X1 @ X3)=(cP @ X2 @ X4))=>(((X1)=(X2))&((X3)=(X4)))))&![X5:iS > $o]:(((![X1:iS, X2:iS]:((((X5 @ X1)&(X5 @ X2))=>(X5 @ (cP @ X1 @ X2))))&(X5 @ c0))=>![X1:iS]:((X5 @ X1)))))&![X1:iS, X2:iS]:(((cP @ X1 @ X2)!=(c0))))=>![X6:iS > iS > iS > $o]:((![X7:iS, X8:iS, X9:iS]:((((((X7)=(c0))&((X8)=(X9)))|?[X10:iS, X11:iS, X12:iS, X13:iS, X14:iS, X15:iS]:(((((((X7)=(cP @ X10 @ X11))&((X8)=(cP @ X12 @ X13)))&((X9)=(cP @ X14 @ X15)))&(X6 @ X10 @ X12 @ X14))&(X6 @ X11 @ X13 @ X15)))|(((X7)=(X9))&((X8)=(c0))))=>(X6 @ X7 @ X8 @ X9)))=>(X6 @ (cP @ c0 @ y) @ (cP @ x @ y) @ (cP @ x @ y)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cS_INCL_LEM5_pme])])). 0.19/0.49 thf(c_0_2, negated_conjecture, ![X36:iS, X37:iS, X38:iS, X39:iS, X40:iS > $o, X43:iS, X44:iS, X45:iS, X47:iS, X48:iS, X49:iS, X50:iS, X51:iS, X52:iS, X53:iS, X54:iS, X55:iS]:((((((((X36)=(X37))|((cP @ X36 @ X38)!=(cP @ X37 @ X39)))&(((X38)=(X39))|((cP @ X36 @ X38)!=(cP @ X37 @ X39))))&((((X40 @ (esk1_1 @ X40))|~(X40 @ c0)|(X40 @ X43))&((X40 @ (esk2_1 @ X40))|~(X40 @ c0)|(X40 @ X43)))&(~(X40 @ (cP @ (esk1_1 @ X40) @ (esk2_1 @ X40)))|~(X40 @ c0)|(X40 @ X43))))&((cP @ X44 @ X45)!=(c0)))&((((((X47)!=(c0))|((X48)!=(X49))|(epred1_0 @ X47 @ X48 @ X49))&(((X47)!=(cP @ X50 @ X51))|((X48)!=(cP @ X52 @ X53))|((X49)!=(cP @ X54 @ X55))|~(epred1_0 @ X50 @ X52 @ X54)|~(epred1_0 @ X51 @ X53 @ X55)|(epred1_0 @ X47 @ X48 @ X49)))&(((X47)!=(X49))|((X48)!=(c0))|(epred1_0 @ X47 @ X48 @ X49)))&~(epred1_0 @ (cP @ c0 @ y) @ (cP @ x @ y) @ (cP @ x @ y))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 0.19/0.49 thf(c_0_3, negated_conjecture, ![X1:iS, X2:iS, X3:iS]:(((epred1_0 @ X1 @ X2 @ X3)|((X1)!=(c0))|((X2)!=(X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_4, negated_conjecture, ![X1:iS, X5:iS > $o]:(((X5 @ (esk2_1 @ X5))|(X5 @ X1)|~((X5 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_5, negated_conjecture, ![X1:iS]:((epred1_0 @ c0 @ X1 @ X1)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_3])])). 0.19/0.49 thf(c_0_6, negated_conjecture, ![X1:iS, X5:iS > $o]:(((X5 @ (esk1_1 @ X5))|(X5 @ X1)|~((X5 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_7, negated_conjecture, ![X1:iS, X2:iS, X4:iS, X7:iS, X3:iS, X9:iS, X8:iS, X10:iS, X11:iS]:(((epred1_0 @ X1 @ X4 @ X9)|((X1)!=(cP @ X2 @ X3))|((X4)!=(cP @ X7 @ X8))|((X9)!=(cP @ X10 @ X11))|~((epred1_0 @ X2 @ X7 @ X10))|~((epred1_0 @ X3 @ X8 @ X11)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_8, negated_conjecture, ![X1:iS, X2:iS, X3:iS]:(((epred1_0 @ X1 @ X3 @ X2)|((X1)!=(X2))|((X3)!=(c0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_9, negated_conjecture, ![X1:iS]:(((epred1_0 @ (esk2_1 @ (^[Z0:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))))|(epred1_0 @ X1 @ X1 @ X1))), inference(spm,[status(thm)],[c_0_4, c_0_5])). 0.19/0.49 thf(c_0_10, negated_conjecture, ![X1:iS]:(((epred1_0 @ (esk1_1 @ (^[Z0:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))))|(epred1_0 @ X1 @ X1 @ X1))), inference(spm,[status(thm)],[c_0_6, c_0_5])). 0.19/0.49 thf(c_0_11, negated_conjecture, ~((epred1_0 @ (cP @ c0 @ y) @ (cP @ x @ y) @ (cP @ x @ y))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_12, negated_conjecture, ![X2:iS, X1:iS, X4:iS, X3:iS, X8:iS, X7:iS]:(((epred1_0 @ (cP @ X1 @ X2) @ (cP @ X3 @ X4) @ (cP @ X7 @ X8))|~((epred1_0 @ X2 @ X4 @ X8))|~((epred1_0 @ X1 @ X3 @ X7)))), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_7])])])). 0.19/0.49 thf(c_0_13, negated_conjecture, ![X1:iS, X5:iS > $o]:(((X5 @ X1)|~((X5 @ (cP @ (esk1_1 @ X5) @ (esk2_1 @ X5))))|~((X5 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_14, negated_conjecture, ![X1:iS]:((epred1_0 @ X1 @ c0 @ X1)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_8])])). 0.19/0.49 thf(c_0_15, negated_conjecture, (epred1_0 @ (esk2_1 @ (^[Z0:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0:iS]:((epred1_0 @ Z0 @ Z0 @ Z0))))), inference(ef,[status(thm)],[c_0_9])). 0.19/0.49 thf(c_0_16, negated_conjecture, (epred1_0 @ (esk1_1 @ (^[Z0:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0:iS]:((epred1_0 @ Z0 @ Z0 @ Z0))))), inference(ef,[status(thm)],[c_0_10])). 0.19/0.49 thf(c_0_17, negated_conjecture, ~((epred1_0 @ y @ y @ y)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_5])])). 0.19/0.49 thf(c_0_18, negated_conjecture, ![X1:iS]:((epred1_0 @ X1 @ X1 @ X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_12]), c_0_14])]), c_0_15]), c_0_16])])). 0.19/0.49 thf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_18])]), ['proof']). 0.19/0.49 # SZS output end CNFRefutation 0.19/0.49 # Parsed axioms : 6 0.19/0.49 # Removed by relevancy pruning/SinE : 0 0.19/0.49 # Initial clauses : 15 0.19/0.49 # Removed in clause preprocessing : 5 0.19/0.49 # Initial clauses in saturation : 10 0.19/0.49 # Processed clauses : 70 0.19/0.49 # ...of these trivial : 5 0.19/0.49 # ...subsumed : 13 0.19/0.49 # ...remaining for further processing : 52 0.19/0.49 # Other redundant clauses eliminated : 43 0.19/0.49 # Clauses deleted for lack of memory : 0 0.19/0.49 # Backward-subsumed : 10 0.19/0.49 # Backward-rewritten : 4 0.19/0.49 # Generated clauses : 330 0.19/0.49 # ...of the previous two non-redundant : 240 0.19/0.49 # ...aggressively subsumed : 0 0.19/0.49 # Contextual simplify-reflections : 0 0.19/0.49 # Paramodulations : 225 0.19/0.49 # Factorizations : 24 0.19/0.49 # NegExts : 0 0.19/0.49 # Equation resolutions : 70 0.19/0.49 # Propositional unsat checks : 0 0.19/0.49 # Propositional check models : 0 0.19/0.49 # Propositional check unsatisfiable : 0 0.19/0.49 # Propositional clauses : 0 0.19/0.49 # Propositional clauses after purity: 0 0.19/0.49 # Propositional unsat core size : 0 0.19/0.49 # Propositional preprocessing time : 0.000 0.19/0.49 # Propositional encoding time : 0.000 0.19/0.49 # Propositional solver time : 0.000 0.19/0.49 # Success case prop preproc time : 0.000 0.19/0.49 # Success case prop encoding time : 0.000 0.19/0.49 # Success case prop solver time : 0.000 0.19/0.49 # Current number of processed clauses : 25 0.19/0.49 # Positive orientable unit clauses : 11 0.19/0.49 # Positive unorientable unit clauses: 0 0.19/0.49 # Negative unit clauses : 2 0.19/0.49 # Non-unit-clauses : 12 0.19/0.49 # Current number of unprocessed clauses: 39 0.19/0.49 # ...number of literals in the above : 117 0.19/0.49 # Current number of archived formulas : 0 0.19/0.49 # Current number of archived clauses : 24 0.19/0.49 # Clause-clause subsumption calls (NU) : 54 0.19/0.49 # Rec. Clause-clause subsumption calls : 39 0.19/0.49 # Non-unit clause-clause subsumptions : 3 0.19/0.49 # Unit Clause-clause subsumption calls : 17 0.19/0.49 # Rewrite failures with RHS unbound : 0 0.19/0.49 # BW rewrite match attempts : 23 0.19/0.49 # BW rewrite match successes : 13 0.19/0.49 # Condensation attempts : 0 0.19/0.49 # Condensation successes : 0 0.19/0.49 # Termbank termtop insertions : 21820 0.19/0.49 0.19/0.49 # ------------------------------------------------- 0.19/0.49 # User time : 0.015 s 0.19/0.49 # System time : 0.004 s 0.19/0.49 # Total time : 0.019 s 0.19/0.49 # Maximum resident set size: 1864 pages 0.19/0.49 0.19/0.49 # ------------------------------------------------- 0.19/0.49 # User time : 0.018 s 0.19/0.49 # System time : 0.004 s 0.19/0.49 # Total time : 0.022 s 0.19/0.49 # Maximum resident set size: 1740 pages 0.19/0.49 EOF